Search results for "Center problem"

showing 3 items of 3 documents

A Hybrid Strategic Oscillation with Path Relinking Algorithm for the Multiobjective k-Balanced Center Location Problem

2021

This paper presents a hybridization of Strategic Oscillation with Path Relinking to provide a set of high-quality nondominated solutions for the Multiobjective k-Balanced Center Location problem. The considered location problem seeks to locate k out of m facilities in order to serve n demand points, minimizing the maximum distance between any demand point and its closest facility while balancing the workload among the facilities. An extensive computational experimentation is carried out to compare the performance of our proposal, including the best method found in the state-of-the-art as well as traditional multiobjective evolutionary algorithms.

Mathematical optimizationComputer scienceGeneral Mathematics0211 other engineering and technologiesEvolutionary algorithm02 engineering and technologyMulti-objective optimizationSet (abstract data type)path relinkingDiscrete optimization0202 electrical engineering electronic engineering information engineeringComputer Science (miscellaneous)Center (algebra and category theory)multiobjective optimizationEngineering (miscellaneous)021103 operations researchOscillationlcsh:MathematicsWorkload<i>k</i>-balanced problemGreedy Randomized Adaptive Search Procedure (GRASP)lcsh:QA1-939strategic oscillationPath (graph theory)020201 artificial intelligence & image processingdiscrete optimization<i>k</i>-center problemMathematics
researchProduct

A Proximal Solution for a Class of Extended Minimax Location Problem

2005

We propose a proximal approach for solving a wide class of minimax location problems which in particular contains the round trip location problem. We show that a suitable reformulation of the problem allows to construct a Fenchel duality scheme the primal-dual optimality conditions of which can be solved by a proximal algorithm. This approach permits to solve problems for which distances are measured by mixed norms or gauges and to handle a large variety of convex constraints. Several numerical results are presented.

Mathematical optimizationClass (set theory)Optimality criterionComputer scienceScheme (mathematics)1-center problemRegular polygonMinimax problemConstruct (python library)Variety (universal algebra)Minimax
researchProduct

Infinite orbit depth and length of Melnikov functions

2019

Abstract In this paper we study polynomial Hamiltonian systems d F = 0 in the plane and their small perturbations: d F + ϵ ω = 0 . The first nonzero Melnikov function M μ = M μ ( F , γ , ω ) of the Poincare map along a loop γ of d F = 0 is given by an iterated integral [3] . In [7] , we bounded the length of the iterated integral M μ by a geometric number k = k ( F , γ ) which we call orbit depth. We conjectured that the bound is optimal. Here, we give a simple example of a Hamiltonian system F and its orbit γ having infinite orbit depth. If our conjecture is true, for this example there should exist deformations d F + ϵ ω with arbitrary high length first nonzero Melnikov function M μ along…

PolynomialDynamical Systems (math.DS)Iterated integrals01 natural sciencesHamiltonian system03 medical and health sciences0302 clinical medicineFOS: MathematicsCenter problem030212 general & internal medicine0101 mathematicsMathematics - Dynamical Systems[MATH]Mathematics [math]Mathematical PhysicsMathematical physicsPoincaré mapPhysicsConjecturePlane (geometry)Applied Mathematics010102 general mathematicsMSC : primary 34C07 ; secondary 34C05 ; 34C08Loop (topology)Bounded functionMAPOrbit (control theory)Analysis34C07 34C05 34C08
researchProduct